A GROUP THEORETIC DUAL PROBLEM WITHOUT DUALITY GAPS FOR BOUNDED INTEGER PROGRAMS
نویسندگان
چکیده
منابع مشابه
A Group Theoretic Dual Problem without Duality Gaps for Bounded Integer Programs
We present a procedure for constructing a group theoretic dual problem with no duality gap to a given bounded integer programming problem. An optimal solution of this dual problem is easily determined and an optimal solution of the integer programming problem can be obtained by solving only one group optimization problem.
متن کاملStochastic programs without duality gaps
This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical finance. We give sufficient conditions for the existence of solutions and the absence of a duality gap. Our proof uses extended dynamic programming equations, whose validity is established under new relaxed conditions tha...
متن کاملStochastic programs without duality gaps for objectives without a lower bound
This paper studies parameterized stochastic optimization problems in finite discrete time that arise in many applications in operations research and mathematical finance. We prove the existence of solutions and the absence of a duality gap under conditions that relax the boundedness assumption made by Pennanen and Perkkiö in [Stochastic programs without duality gaps, Math. Program., 136(1):91–1...
متن کاملGenerating functions and duality for integer programs
We consider the integer program P→max{c′x|Ax = y;x ∈ N}. Using the generating function of an associated counting problem, and a generalized residue formula of Brion and Vergne, we explicitly relate P with its continuous linear programming (LP) analogue and provide a characterization of its optimal value. In particular, dual variables λ ∈ R have discrete analogues z ∈ C, related in a simple mann...
متن کاملDuality for Mixed Integer Linear Programs
The theory of duality for linear programs is well-developed and has been successful in advancing both the theory and practice of linear programming. In principle, much of this broad framework can be extended to mixed integer linear programs, but this has proven difficult, in part because duality theory does not integrate well with current computational practice. This paper surveys what is known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1980
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.23.146